The Lane hash function. Extended Abstract
نویسندگان
چکیده
In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3,9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the rationale behind the important design choices. For a more extended specification, security analysis and a discussion of the implementation aspects, we refer to the Lane submission document [6].
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملCoding Theory and Hash Function Design - A Case Study: The Lane Hash Function
We illustrate how coding theory was applied in the design of the cryptographic hash function LANE [8]. The generic structure of the LANE compression function could potentially be vulnerable to a class of meet-in-the-middle attacks. While difficult to avoid at first sight, restating the problem in the domain of error correcting codes naturally leads to a simple and elegant solution. This ensures...
متن کاملA Practical Attack against Knapsack based Hash Functions (Extended Abstract)
In this paper, we show that lattice reduction is a very powerful tool to nd collision in knapsack based compression-functions and hash-functions. In particular, it can be used to break the knapsack based hash-function that was introduced by Damgard 3]
متن کاملRebound Attack on the Full Lane Compression Function
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated...
متن کاملOne - way Accumulators : A Decentralized Alternative to Digital Signatures ( Extended Abstract )
This paper describes a simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used aa an accumulator. This property allows protocols to be developed in which the need for a trusted central authority can be eliminated. Spaceefficient distributed protocols are given for document time stamping and for membership testing, and many other applications...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008